Decidability of Strong Bisimilarity for Timed BPP
نویسنده
چکیده
We investigate a timed extension of the class of Basic Parallel Processes (BPP), in which actions are durational and urgent and parallel components have independent local clocks. The main result is decidability of strong bisimilarity, known also as performance equivalence, in this class. This extends the earlier decidability result for plain BPP [8] as well as decidability for timed BPP with strictly positive durations of actions [3]. Both ill-timed and well-timed semantics are treated. Our decision procedure is based on decidability of the validity problem for Presburger arithmetic.
منابع مشابه
Note on the Tableau Technique for Commutative Transition Systems
We define a class of transition systems called effective commutative transition systems (ECTS) and show, by generalising a tableaubased proof for BPP, that strong bisimilarity between any two states of such a transition system is decidable. It gives a general technique for extending decidability borders of strong bisimilarity for a wide class of infinite-state transition systems. This is demons...
متن کاملDecidability Questions for Bismilarity of Petri Nets and Some Related Problems
The main result is undecidability of bisimilarity for labelled (place/transition) Petri nets. The same technique applies to the (preex) language equivalence and reachability set equality, which yields stronger versions with simpler proofs of already known results. The paper also shows decidability of bisimilarity if one of the nets is deterministic up to bisimilarity. Another decidability resul...
متن کاملComplexity of Checking Bisimilarity between Sequential and Parallel Processes
Decidability of bisimilarity for Process Algebra (PA) processes, arising by mixing sequential and parallel composition, is a longstanding open problem. The known results for subclasses contain the decidability of bisimilarity between basic sequential (i.e. BPA) processes and basic parallel processes (BPP). Here we revisit this subcase and derive an exponential-time upper bound. Moreover, we sho...
متن کاملBranching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable
In this paper we present polynomial time algorithms deciding branching bisimilarity between finite-state systems and several classes of infinite-state systems: BPA and normed BPP. The algorithm for BPA improves a previous one given by Kučera and Mayr, while the one for normed BPP demonstrates the polynomial-time decidability of the problem, which is unknown previously. The proof style follows a...
متن کاملDeciding Bisimulation-Like Equivalences with Finite-State Processes
We design a general method for proving decidability of bisimulationlike equivalences between infinite-state processes and finite-state ones. We apply this method to the class of PAD processes, which strictly subsumes PA and pushdown (PDA) processes, showing that a large class of bisimulation-like equivalences (including e.g. strong and weak bisimilarity) is decidable between PAD and finite-stat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002